A representation theorem for distribution semigroups
نویسندگان
چکیده
منابع مشابه
A Maximal Theorem for Holomorphic Semigroups
This has a unique solution v(x, t) = Ttf(x) in the sense of Hille and Phillips [14, p. 622] whenever Tt is a C0–semigroup on X with generator −A; one writes Tt = e−tA [14, p. 321]. In order to ensure that v(x, t) converges μ-almost everywhere to f(x) as t→ 0+, it is often necesary to impose further conditions on f . For any closed linear operator V in X, we recall that the domain of V is the Ba...
متن کاملAnisimov's Theorem for inverse semigroups
The idempotent problem of a finitely generated inverse semi-group is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent problem is necessarily finite. This answers a question of Gilbert and Noonan Heale, and establishes a gen-eralisation to inverse semigroups of Anisimov's Th...
متن کاملThe Cauchy-davenport Theorem for Semigroups
We generalize the Davenport transform to prove that, for A = (A,+) a cancellative unital semigroup and X,Y subsets of A such that the smallest subsemigroup generated by Y is commutative, one has that |X + Y | ≥ Ω(X,Y ) := min ( |X|+ |Y | − 1, sup y0∈Y× min y∈Y \{y0} ord(y − y0) ) if 2 ≤ |X|, |Y | < ∞. While extending the Cauchy-Davenport theorem to the broader and abstract setting of (possibly ...
متن کاملA Theorem on Anti - Ordered Factor - Semigroups
Let K be an anti-ideal of a semigroup (S,=, =, ·, θ) with apartness. A construction of the anti-congruence Q(K) and the quasi-antiorder θ, generated by K, are presented. Besides, a construction of the anti-order relation Θ on syntactic semigroup S/Q(K), generated by θ, is given in Bishop’s constructive mathematics.
متن کاملRepresentation Theorem for Stacks
In this paper i is a natural number and x is a set. Let A be a set and let s1, s2 be finite sequences of elements of A. Then s1s2 is an element of A∗. Let A be a set, let i be a natural number, and let s be a finite sequence of elements of A. Then s i is an element of A∗. The following two propositions are true: (1) ∅ i = ∅. (2) Let D be a non empty set and s be a finite sequence of elements of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 1970
ISSN: 0022-1236
DOI: 10.1016/0022-1236(70)90048-0